Solubility of Fermat Equations

نویسنده

  • R. Dietmann
چکیده

The arithmetic of the equation a1x d 1 + a2x d 2 + a3x d 3 = 0 is considered for d > 2, with the outcome that the set of coefficients for which the equation admits a non-zero integer solution is shown to have density zero.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ENTIRE SOLUTIONS OF FERMAT TYPE q-DIFFERENCE DIFFERENTIAL EQUATIONS

In this article, we describe the finite-order transcendental entire solutions of Fermat type q-difference and q-difference differential equations. In addition, we investigate the similarities and other properties among those solutions.

متن کامل

SOLVING FERMAT - TYPE EQUATIONS x

In this paper, we are interested in solving the Fermat-type equations x5 + y5 = dzp, where d is a positive integer and p a prime number ≥ 7. We describe a new method based on modularity theorems which allows us to improve all earlier results for this equation. We finally discuss the present limits of the method by looking at the case d = 3.

متن کامل

Fermat - holonomic congruences

Fermat-holonomic congruences are proposed as a weaker substitute for the too restrictive class of Born-rigid motions. The definition is expressed as a set of differential equations. Integrability conditions and Cauchy data are studied.

متن کامل

On the Zeta Function of Forms of Fermat Equations

We study “forms of the Fermat equation” over an arbitrary field k, i.e. homogenous equations of degree m in n unknowns that can be transformed into the Fermat equation Xm 1 +. . .+Xm n by a suitable linear change of variables over an algebraic closure of k. Using the method of Galois descent, we classify all such forms. In the case that k is a finite field of characteristic greater than m that ...

متن کامل

Solving Fermat-type equations x5+y5=dzp

In this paper, we are interested in solving the Fermat-type equations x+y = dz where d is a positive integer and p a prime number ≥ 7. We describe a new method based on modularity theorems which allows us to improve all the results of [1]. We finally discuss the present limitations of the method by looking at the case d = 3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008